Green road–rail intermodal routing problem with improved pickup and delivery services integrating truck departure time planning under uncertainty: an interactive fuzzy programming approach

نویسندگان

چکیده

Abstract This paper addresses the multi-objective optimization for road–rail intermodal routing problem that aims to minimize total costs and carbon dioxide emissions of routes. To achieve high timeliness entire transportation process, pickup delivery services are simultaneously improved based on employment fuzzy soft time windows measure their service levels. The modeling considers fixed schedules rail flexibility road match real-world scenario, in which travel times emission factors considered be time-varying. improve feasibility routing, uncertainty capacities incorporated into problem. By applying trapezoidal numbers formulate uncertainty, we propose a nonlinear model integrates truck departure planning services. After processing with chance-constrained programming linearization, obtain an auxiliary equivalent crisp linear solve it by designing interactive approach Bounded Objective Function method. Based empirical case study, demonstrate validity proposed discuss effects improving confidence levels results. analysis reveals several managerial insights help realize efficient organization making effective trade-offs among lowering costs, reducing emissions, levels, enhancing feasibility.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm

Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...

متن کامل

STOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES

The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...

متن کامل

A Hybrid Algorithm for a Two-Echelon Location- Routing Problem with Simultaneous Pickup and Delivery under Fuzzy Demand

Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...

متن کامل

An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

متن کامل

An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complex & Intelligent Systems

سال: 2021

ISSN: ['2198-6053', '2199-4536']

DOI: https://doi.org/10.1007/s40747-021-00598-1